A separable space with no Schauder decomposition
نویسندگان
چکیده
منابع مشابه
bv as a non separable dual space
let c be a field of subsets of a set i. also, let 1 i i be a non-decreasing positivesequence of real numbers such that 1, 1 0 1 i and 11 i i . in this paper we prove thatbv of all the games of -bounded variation on c is a non-separable and norm dual banach space of thespace of simple games on c . we use this fact to establish the existence of a linear mapping t from...
متن کاملDecomposition of Separable Concave
This paper presents a decomposition scheme for a large class of greyscale structuring elements from mathematical morphology. In contrast with many existing decomposition schemes, our method is valid in the continuous domain. Conditions are given under which this continuous method can be properly discretized. The class of functions that can be decomposed with our method contains the class of qua...
متن کاملEecient Decomposition of Separable Algebras
We present new, eecient algorithms for computations on separable matrix algebras over innnite elds. We provide a probabilistic of the Monte Carlo type to nd a generator for the centre of a given algebra A F mm over an innnite eld F using a number of operations that is within a logarithmic factor of the cost of solving m m systems of linear equations. A Las Vegas algorithm is also provided under...
متن کاملA Representation Theorem for Schauder Bases in Hilbert Space
A sequence of vectors {f1, f2, f3, . . . } in a separable Hilbert space H is said to be a Schauder basis for H if every element f ∈ H has a unique norm-convergent expansion f = ∑ cnfn. If, in addition, there exist positive constants A and B such that A ∑ |cn| ≤ ∥∥∥∑ cnfn∥∥∥2 ≤ B∑ |cn|, then we call {f1, f2, f3, . . . } a Riesz basis. In the first half of this paper, we show that every Schauder ...
متن کاملEfficient decomposition of separable algebras
We present new, efficient algorithms for computations on separable matrix algebras over infinite fields. We provide a probabilistic method of the Monte Carlo type to find a generator for the centre of a given algebra A ⊆ Fm×m over an infinite field F. The number of operations used is within a logarithmic factor of the cost of solving m×m systems of linear equations. A Las Vegas algorithm is als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1999
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-99-05370-8